Rounds a number up to the nearest odd integer 将正(负)数向上(下)舍入到最接近的奇数
Let D be a positive odd integer. 设D是正奇数。
Given any fast modular inversion algorithm for odd mod ulus, this algorithm can quickly calculate to modular inversion for any positive integer modulus. 给定任意一种奇数模的快速模逆算法,本算法能快速实现任意正整数模的模逆。
Let r be an odd integer with r> 1, and let m be an even integer. 设r是大于1的正奇数,m是偶数。
Let p be an odd prime, and let D be a positive integer with 2D and pD. 设p是奇素数,D是适合pD的正奇数。